Multiple Polyline to Polygon Matching
نویسندگان
چکیده
This paper addresses the partial shape matching problem, which helps identifying similarities even when a significant portion of one shape is occluded, or seriously distorted. We introduce a measure for computing the similarity between multiple polylines and a polygon, that can be computed in O(kmn) time with a straightforward dynamic programming algorithm. We then present a novel fast algorithm that runs in time O(kmn log mn). Here, m denotes the number of vertices in the polygon, and n is the total number of vertices in the k polylines that are matched against the polygon. The effectiveness of the similarity measure has been demonstrated in a part-based retrieval application with known ground-truth.
منابع مشابه
From Polyline to Polygon via XOR tree
In this paper it is discussed a new method to transform a closed and possibly unconnected polyline into a plane polygon represented as a BSP tree In particular it is shown that each such polygon can be expressed as the Boolean XOR of unbounded quadrilateral stripes bijectively associated to the polyline edges Such a representation has a space complexity of O n where n is the number of polygon e...
متن کاملMatching of Polygon Objects by Optimizing Geometric Criteria
Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....
متن کاملOn-Line Construction of the Convex Hull of a Simple Polyline
After McCallum and Avis [4] showed that the convex hull of a simple polygon P with n vertices can be constructed in O(n) time, several authors [1,2,3] devised simplified algorithms for this problem. Graham and Yao [2] presented a particularly simple and elegant one. After finding two points of the convex hull, their algorithm generated all other hull vertices using only one stack for intermedia...
متن کاملExtraction of key frames from videos by optimal color composition matching and polygon simplification
A video sequence is first mapped to a sequence of points in a semi-metric space that forms a polyline. We require only that a semi-distance between pairs of points be defined that need not satisfy the triangle inequality. By simplifying the polyline, we obtain a small set of the most relevant key frames that is representative of the whole video sequence. The degree of the simplification is eith...
متن کاملNew Similarity Measures between Polylines with Applications to Morphing and Polygon
We introduce two new related metrics, the geodesic width and the link width, for measuring the “distance” between two nonintersecting polylines in the plane. If the two polylines have n vertices in total, we present algorithms to compute the geodesic width of the two polylines in O(n2 log n) time using O(n2) space and the link width in O(n3 log n) time using O(n2) working space where n is the t...
متن کامل